/*
	Name: [SCOI2009]游戏  
	Author: There,hello
	Date: 03-11-19 17:25
	Description: Luogu P4161
	Algorithm: 数论+DP
*/
#include <bits/stdc++.h>
using namespace std;
int n;
int pr[200], tail;
long long f[1111];
bool v[1111];
int main()
{
    scanf("%d", &n);
    for (int i = 2; i <= n; ++i)
    {
        if (!v[i])
        {
            pr[++tail] = i;
            for (int j = i; j <= n / i; ++j)
            {
                v[i * j] = 1;
            }
        }
    }
    f[0] = 1;
    for (int i = 1; i <= tail; ++i)
    {
        for (int j = n; j >= 1; --j)
        {
            for (int k = pr[i]; k <= j; k *= pr[i])
            {
                f[j] += f[j - k];
            }
        }
    }
    for (int i = 1; i <= n; ++i)
        f[0] += f[i];
    printf("%lld", f[0]);
    return 0;
}